Polygonal Mesh Simplification with Face Color and Boundary Edge Preservation Using Quadric Error Metric

نویسندگان

  • Chin-Shyurng Fahn
  • Hung-Kuang Chen
  • Yi-Haur Shiau
چکیده

In the applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and to construct the multiresolution representation. In this paper, we propose a new and simple constraint scheme based on the quadric error metric proposed by Garland and Heckbert [1] to preserve face colors and boundary edges during the simplification process. In addition, our method generates progressive meshes that store the polygonal mesh in a continuous multi-resolution representation. According to our experimental results, this new method is successful in preserving face colors and boundary edges. Moreover, we compare the latency of resolution changes for the progressive meshes of various models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric

This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the adjacency queries between components of the mesh, such as vertices, faces and edges, can be quickly achieved and thus the run time is reduced remarkably. Furthermore, with the modified quadric error metric, the qualit...

متن کامل

Quadric-Based Polygonal Surface Simplification

Many applications in computer graphics and related fields can benefit from automatic simplification of complex polygonal surface models. Applications are often confronted with either very densely over-sampled surfaces or models too complex for the limited available hardware capacity. An effective algorithm for rapidly producing high-quality approximations of the original model is a valuable too...

متن کامل

Polyline Simpliication Using Quadric Error Metric with Bounded Error Polyline Simpliication Using Quadric Error Metric with Bounded Error Polyline Simpliication Using Quadric Error Metric with Bounded Error

We study the problem of polygonal line simpliication. The objective is to seek a polygonal line of smaller size that approximates the original one well. We present an algorithm that is based on edge contraction. An edge contraction merges two adjacent vertices into a new vertex and this new vertex will be made the new endpoint of the uncontracted edges incident to the two vertices merged. Thus,...

متن کامل

Three-dimensional mesh simplification using normal variation error metric and modified subdivided edge classification

In order to transmit or store three-dimensional (3-D) mesh models efficiently, we need to simplify them. Although the quadric error metric (QEM) provides fast and accurate geometric simplification of 3-D mesh models, it cannot capture discontinuities faithfully. Recently, an enhanced QEM based on subdivided edge classification has been proposed to handle this problem. Although it can capture di...

متن کامل

Discrete Differential Error Metric for Surface Simplification

In this paper we propose a new discrete differential error metric for surface simplification. Many surface simplification algorithms have been developed in order to produce rapidly high quality approximations of polygonal models, and the quadric error metric based on the distance error is the most popular and successful error metric so far. Even though such distance based error metrics give vis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002